Strong Edge Coloring of Cayley Graphs and Some Product Graphs

Abstract A strong edge coloring of a graph G is proper such that every color class an induced matching. The minimum number colors required termed the chromatic index. In this paper we determine exact value index all unitary Cayley graphs. Our investigations reveal underlying product structure from which graphs emerge. We then go on to give tight bounds for Cartesian two trees, including formula in case stars. Further, tree with cycle. For any tree, those may differ actual only by not more than small additive constant (at most 2 even cycles and at 4 odd cycles), moreover they yield when length cycle divisible 4.